Probabilistic Logic with Strong Independence
نویسندگان
چکیده
This papers investigates the manipulation of statements of strong independence in probabilistic logic. Inference methods based on polynomial programming are presented for strong independence, both for unconditional and conditional cases. We also consider graph-theoretic representations, where each node in a graph is associated with a Boolean variable and edges carry a Markov condition. The resulting model generalizes Bayesian networks, allowing probabilistic assessments and logical constraints to be mixed.
منابع مشابه
Probabilistic logic with independence
This paper investigates probabilistic logics endowed with independence relations. We review propositional probabilistic languages without independence, and then consider graph-theoretic representations for propositional probabilistic logic with independence; complexity is analyzed, algorithms are derived, and examples are discussed. Finally, we examine a restricted first order probabilistic log...
متن کاملAssembling a consistent set of sentences in relational probabilistic logic with stochastic independence
We examine the representation of judgements of stochastic independence in probabilistic logics. We focus on a relational logic where (i) judgements of stochastic independence are encoded by directed acyclic graphs, and (ii) probabilistic assessments are flexible in the sense that they are not required to specify a single probability measure. We discuss issues of knowledge representation and inf...
متن کاملFrom Probabilistic Horn Logic to Chain Logic
Probabilistic logics have attracted a great deal of attention during the past few years. Where logical languages have, already from the inception of the field of artificial intelligence, taken a central position in research on knowledge representation and automated reasoning, probabilistic graphical models with their associated probabilistic basis have taken up in recent years a similar positio...
متن کاملProbabilistic Logic with Conditional Independence Formulae
We investigate a probabilistic propositional logic that is an extension of the logic proposed by Fagin et al. [4] with conditional independence formulae. We give an axiomatization which we show to be complete for the kind of inferences allowed by Bayesian networks.
متن کاملProbabilistic Logic with Conditional Independence Formulae1
We investigate probabilistic propositional logic as a way of expressing and reasoning about uncertainty. In contrast to Bayesian networks, a logical approach can easily cope with incomplete information like probabilities that are missing or only known to lie in some interval. However, probabilistic propositional logic as described e.g. by Halpern [9], has no way of expressing conditional indepe...
متن کامل